Minimum 2-Edge Connected Spanning Subgraph of Certain Interconnection Networks
نویسندگان
چکیده
Given an undirected graph, finding a minimum 2-edge connected spanning subgraph is NP-hard. We solve the problem for silicate network, brother cell and sierpiński gasket rhombus.
منابع مشابه
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract)
An efficient heuristic is presented for the problem of finding a minimum-size kconnected spanning subgraph of an (undirected or directed) simple graph G = (V,E). There are four versions of the problem, and the approximation guarantees are as follows: • minimum-size k-node connected spanning subgraph of an undirected graph 1 + [1/k], • minimum-size k-node connected spanning subgraph of a directe...
متن کاملApproximating Minimum-Size k-Connected Spanning Subgraphs via Matching
Abstract An e cient heuristic is presented for the problem of nding a minimum size k connected spanning subgraph of an undirected or directed simple graph G V E There are four versions of the problem and the approximation guarantees are as followsAn e cient heuristic is presented for the problem of nding a minimum size k connected spanning subgraph of an undirected or directed simple graph G V ...
متن کاملRIMS-1826 Approximation Algorithms for the Minimum 2-edge Connected Spanning Subgraph Problem and the Graph-TSP in Regular Bipartite Graphs via Restricted 2-factors By
In this paper, we address the minimum 2-edge connected spanning subgraph problem and the graph-TSP in regular bipartite graphs. For these problems, we present new approximation algorithms, each of which finds a restricted 2-factor close to a Hamilton cycle in the first step. We first prove that every regular bipartite graph of degree at least three has a square-free 2-factor. This immediately l...
متن کاملA Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
In the (k, λ)-subgraph problem, we are given an undirected graph G = (V, E) with edge costs and two positive integers k and λ and the goal is to find a minimum cost simple λ-edge-connected subgraph of G with at least k nodes. This generalizes several classical problems, such as the minimum cost k-Spanning Tree problem or k-MST (which is a (k, 1)-subgraph), and minimum cost λ-edge-connected span...
متن کاملOn Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem
We present the rst truly polynomial-time approximation scheme (PTAS) for the minimum-cost k-vertex-(or, k-edge-) connected spanning subgraph problem for complete Euclidean graphs in R d : Previously it was known for every positive constant " how to construct in a polynomial time a graph on a superset of the input points which is k-vertex connected with respect to the input points, and whose cos...
متن کامل